Applying a uniform marked morphism to a word
نویسنده
چکیده
We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function. The relations obtained for the image of a word can be used also for the image of a factorial language. Using induction, we give a full description of the involved functions of the fixed point of the morphism considered.
منابع مشابه
Applying a uniform marked morphism to a word y Anna Frid
We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function. The relations obtained for the image of a word can be used also for the image of a factorial language. Using induction, we give a full descripti...
متن کاملThere are k-uniform cubefree binary morphisms for all k >= 0
A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Σ * → Σ * is k-uniform if h(a) has length k for all a ∈ Σ. A morphism is cubefree if it maps cubefree words to cubefree words. We show that for all k ≥ 0 there exists a k-uniform cubefree binary morphism.
متن کاملUnambiguous 1-uniform morphisms
If, for a morphism σ : ∆∗ → Σ∗ (where ∆ and Σ are arbitrary alphabets) and a word α ∈ ∆∗, there exists another morphism τ mapping α to σ(α), then σ is called ambiguous with respect to α ; if such a τ does not exist, then σ is unambiguous. For example, the morphism σ0 : {A,B,C}∗ → {a,b}∗ – given by σ0(A) := a, σ0(B) := a, σ0(C) := b – is ambiguous with respect to the word α0 := ABCACB, since the...
متن کاملOn Morphisms Preserving Primitive Words
A word is called primitive if it cannot be expressed as the power of another word. Morphisms preserving primitive words are investigated. Similarly to the word case, each square-free morphism is a primitive morphism but the converse does not hold. A precise characterization of primitive morphisms is provided in terms of pure codes. An easily testable characterization is given for uniform morphi...
متن کاملAvoiding squares and overlaps over the natural numbers
We consider avoiding squares and overlaps over the natural numbers, using a greedy algorithm that chooses the least possible integer at each step; the word generated is lexicographically least among all such infinite words. In the case of avoiding squares, the word is 01020103 · · · , the familiar ruler function, and is generated by iterating a uniform morphism. The case of overlaps is more cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 3 شماره
صفحات -
تاریخ انتشار 1999